MaxHeap::extractHead()
should remove the head from the heap
MaxHeap::insert(value)
should add an element to the heap
should Keep the highest item as the head
MaxHeap::initial setup
should be empty
Reference Types
should be a function
should be a string object
should be an object
shift(value)
should remove the head of the list
Primitive Types
should be a string
should be a number
pop()
should remove the last item from the list
should remove and return the next entry
Booleans
should be true
should be false
getNodeAt(index)
should return null with an invalid index
should get an item at the specified index
dequeue()
should remove and return the next entry in the queue
enqueue(val)
should add an entry to the queue
push(val)
should add entries to the stack
push(value)
should add an item to the end of the list
should add an item to the list
getNodeAt
should return the correct node
should return a node with a valid index
should return null when passed an index >= the size
should return null when passed an index below 0
should return null when called on empty list
MinHeap::insert(value)
should keep the lowest item as the head
should add items to the heap
insert(value, index)
should add an element to the specified index
MinHeap::initial
should be empty
MinHeap::extractHead()
should remove the head of the heap
unshift(value)
should add an item to the beginning of the list
Initial values
should have no tail
should have no head
should be empty
Initial state of the list
should all be empty
push
should add a node an empty list
should add an element to the end of the list